Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("APPROCHE ALGEBRIQUE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 37

  • Page / 2
Export

Selection :

  • and

CONSTRAINED OPTIMAL CONTROL. THE ALGEBRAIC APPROACH.KUCERA V.1974; KYBERNETIKA; CESKOSL.; DA. 1974; VOL. 10; NO 4; PP. 317-349; BIBL. 6 REF.Article

AN ALGORITHM FOR INTEGER LINEAR PROGRAMMING: A COMBINED ALGEBRAIC AND ENUMERATION APPROACHBRADLEY GH; WAHI PN.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 45-60; BIBL. 1 P. 1/2Serial Issue

Approche algébrique de la limite semi-classique: électrons bidimensionnels en champ magnétique et localisation dynamique = Algebraic semiclassical approach: two dimensional electrons in a magnetic field and dynamical localisationBarelli, Armelle; Bellissard, Jean.1992, 172 p.Thesis

Note on node-rewriting graph grammarsKREOWSKI, H.-J; ROZNBERG, G.Information processing letters. 1984, Vol 18, Num 1, pp 21-24, issn 0020-0190Article

Solutions algébriques pour l'analyse et le contrôle des systèmes non linéaires = Algebraic solutions for the analysis and the control of nonlinear systemsGlumineau, Alain; Moog, Claude.1992, 246 p.Thesis

La quantification vectorielle de forme d'ondes; approche algébrique = Vectorial quantization of waveforms: algebric approachADOUL, Jean-Pierre.1985, 50 p.Report

Estimates of the regularity of recognition and classification problemsCHEREPNIN, A. A.Computational mathematics and mathematical physics. 1993, Vol 33, Num 1, pp 141-144, issn 0965-5425Article

Singular coverings of toposesBunge, Marta; Funk, Jonathon.Lecture notes in mathematics. 2006, issn 0075-8434, isbn 3-540-36359-9, xii, 225 p, isbn 3-540-36359-9Book

Two algebraic approaches to variants of the concatenation productBRANCO, Mario J. J.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 406-426, issn 0304-3975, 21 p.Article

Computations in APSLETICHEVSKY, A. A; KAPITONOVA, J. V; KONOZENKO, S. V et al.Theoretical computer science. 1993, Vol 119, Num 1, pp 145-171, issn 0304-3975Conference Paper

Three-variable statements of set-pairingFORMISANO, Andrea; OMODEO, Eugenio G; POLICRITI, Alberto et al.Theoretical computer science. 2004, Vol 322, Num 1, pp 147-173, issn 0304-3975, 27 p.Conference Paper

Stochastic quantum mechanics viewed from the language of manualsSCHROECK, F. E; FOULIS, D. J.Foundations of physics. 1990, Vol 20, Num 7, pp 823-858, issn 0015-9018, 36 p.Article

Negation of binomial coefficientsSPRUGNOLI, Renzo.Discrete mathematics. 2008, Vol 308, Num 22, pp 5070-5077, issn 0012-365X, 8 p.Article

Problem-oriented verification system and its application to linear algebra programsNEPOMNIASCHY, V. A; SULIMOV, A. A.Theoretical computer science. 1993, Vol 119, Num 1, pp 173-185, issn 0304-3975Conference Paper

Patterson-Wiedemann construction revisitedGANGOPADHYAY, Sugata; KESKAR, Pradipkumar H; MAITRA, Subhamoy et al.Discrete mathematics. 2006, Vol 306, Num 14, pp 1540-1556, issn 0012-365X, 17 p.Conference Paper

Polynomials over the reals in proofs of termination: From theory to practiceLUCAS, Salvador.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 3, pp 547-586, issn 0988-3754, 40 p.Conference Paper

EFFICIENT ALGORITHMS FOR DESCRIPTION PROBLEMS OVER FINITE TOTALLY ORDERED DOMAINSGIL, Angel J; HERMANN, Miki; SALZER, Gernot et al.SIAM journal on computing (Print). 2009, Vol 38, Num 3, pp 922-945, issn 0097-5397, 24 p.Article

Bisimulation on speed: A unified approachLÜTTGEN, Gerald; VOGLER, Walter.Theoretical computer science. 2006, Vol 360, Num 1-3, pp 209-227, issn 0304-3975, 19 p.Article

Outer estimation of generalized solution sets to interval linear systemsSHARY, S. P.Reliable computing. 1999, Vol 5, Num 3, pp 323-335, issn 1385-3139Conference Paper

Reconstructing weighted graphs with minimal query complexityBSHOUTY, Nader H; MAZZAWI, Hanna.Theoretical computer science. 2011, Vol 412, Num 19, pp 1782-1790, issn 0304-3975, 9 p.Article

Metaphors and heuristic-driven theory projection (HDTP)GUST, Helmar; KÜHNBERGE, Kai-Uwe; SCHMID, Ute et al.Theoretical computer science. 2006, Vol 354, Num 1, pp 98-117, issn 0304-3975, 20 p.Conference Paper

ALGEBRAIC ALGORITHMS FOR MATCHING AND MATROID PROBLEMSHARVEY, Nicholas J. A.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 679-702, issn 0097-5397, 24 p.Conference Paper

H-Coloring dichotomy revisitedBULATOV, Andrei A.Theoretical computer science. 2005, Vol 349, Num 1, pp 31-39, issn 0304-3975, 9 p.Conference Paper

A generalized algebraic approach to uncertainty processing in rule-based expert systems (dempsteroids)HAJEK, P; VALDES, J. J.Computers and artificial intelligence. 1991, Vol 10, Num 1, pp 29-42, issn 0232-0274Article

Correct hardware synthesis An algebraic approachPERNA, Juan; WOODCOCK, Jim; SAMPAIO, Augusto et al.Acta informatica. 2011, Vol 48, Num 7-8, pp 363-396, issn 0001-5903, 34 p.Article

  • Page / 2